yard crane scheduling in port container terminals using genetic algorithm

yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in this model which we can mention to yard crane non- interference constraint is that they usually move on the same rails in the yard block. optimization methods, like branch and bound algorithm, has no sufficient efficiency to solve this model and become perfectly useless when the problem size increases. in this situation, using an advanced search method like genetic algorithm (ga) may be suitable. in this paper, a ga is proposed to obtain near optimal solutions. the ga is run by matlab 7.0 and the researchers used lingo software which benefits from the branch and bound algorithm for comparing outputs of ga and the exact solution. we should consider the abilities of the lingo software which is not capable of solving the problems larger than 5 slots to 3 yard cranes. the computational results show that the proposed ga is effective and efficient in solving the considered yard crane scheduling problem.